branch and bound technique
- branch and bound technique
- методы ветвей и границ
методы ветвей и границ
Один из общих подходов к решению дискретных задач оптимального программирования, для которых еще не выработаны специфические способы (алгоритмы) решения. Они характеризуются частичным целенаправленным перебором возможных вариантов. При этом решаемая задача последовательно «ветвится», заменяясь более простыми, и путем анализа с помощью графа «дерево задач» отбрасываются заведомо непригодные варианты, чем облегчается дальнейший перебор.
[http://slovar-lopatnikov.ru/]
Тематики
EN
- branch and bound technique
Англо-русский словарь нормативно-технической терминологии.
academic.ru.
2015.
Смотреть что такое "branch and bound technique" в других словарях:
Branch and bound — Séparation et évaluation Un algorithme par séparation et évaluation, également appelé selon le terme anglo saxon branch and bound, est une méthode générique de résolution de problèmes d optimisation, et plus particulièrement d optimisation… … Wikipédia en Français
Branch and price — est une méthode d optimisation combinatoire pour résoudre des problèmes d optimisation linéaire en nombres entiers. Cette méthode combine l algorithme du branch and bound classique avec une génération de colonnes à chaque nœud de l arbre.… … Wikipédia en Français
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Relaxation technique (mathematics) — A relaxation technique is a method in mathematical optimization for relaxing a strict requirement, by either substituting for it another more easily handled requirement or else dropping it completely. Relaxation techniques are commonly used in… … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
Law, Crime, and Law Enforcement — ▪ 2006 Introduction Trials of former heads of state, U.S. Supreme Court rulings on eminent domain and the death penalty, and high profile cases against former executives of large corporations were leading legal and criminal issues in 2005.… … Universalium
Computers and Information Systems — ▪ 2009 Introduction Smartphone: The New Computer. The market for the smartphone in reality a handheld computer for Web browsing, e mail, music, and video that was integrated with a cellular telephone continued to grow in 2008. According to… … Universalium
Shifting bottleneck heuristic — The Shifting Bottleneck Heuristic is a procedure intended to minimize the time it takes to do work, or specifically, the makespan in a job shop. The makespan is defined as the amount of time, from start to finish, to complete a set of multi… … Wikipedia
М — Магистраль [turnpike] Мажоритарный акционер (Majority shareholder) Мажоритарная доля собственности (majority interest) Мажоритарный контроль (majority control) … Экономико-математический словарь
Comparison of Java and C++ — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
fable, parable, and allegory — Introduction any form of imaginative literature (allegory) or spoken utterance constructed in such a way that readers or listeners are encouraged to look for meanings hidden beneath the literal surface of the fiction. A story (rhetoric) is… … Universalium
